A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2

Source URL: people.mpi-inf.mpg.de

• Formal methods
• Automated theorem proving
• Logic in computer science
• Boolean algebra
• Electronic design automation
• Conflict-Driven Clause Learning
• Boolean satisfiability problem
• Satisfiability modulo theories
• Clause
• Vampire
• Propositional calculus
• Lambda calculus

The Need for Humans in the Loop: Meeting the Grand Challenge of Full Functional Verification Matt Kaufmann & J Strother Moore Department of Computer Science University of Texas at Austin Austin, TX 78701

Source URL: fm.csl.sri.com

• Formal methods
• Technical communication
• Automated theorem proving
• Theoretical computer science
• Logic in computer science
• Formal verification
• ACL2
• Functional verification
• User interface
• Proof assistant
• Usability
• Verification and validation

Automated Discovery of Inductive Lemmas Moa Johansson NI VER

Source URL: www.cse.chalmers.se

• Automated theorem proving
• Rippling
• Theorem
• IsaPlanner
• Lemma
• Algorithm
• Analysis

Abstracts Abstracts are listed in the order of presentation. Monday, 18 April Bin Packing: From Theory to Experiment and Back Again David S. Johnson

Source URL: events.cs.bham.ac.uk

• Logic in computer science
• Formal methods
• Philosophical logic
• Metalogic
• Formal verification
• Theoretical computer science
• First-order logic
• Modal logic
• Logic
• Mathematical logic
• P versus NP problem
• Automated theorem proving

Proving Autonomous Vehicle and Advanced Driver Assistance Systems Safety  

Source URL: utc.ices.cmu.edu

• Formal systems
• Proof theory
• Logic in computer science
• Formal methods
• Theoretical computer science
• KeY
• Automated theorem proving
• Mathematical proof
• Formal verification
• Mathematical logic
• Modal logic
• Dynamic logic

Automated Theorem Proving Peter Baumgartner http://users.rsise.anu.edu.au/˜baumgart/ Slides partially based on material by Alexander Fuchs, Harald Ganzinger, John Slaney, Viorica Sofronie-

Source URL: ssll.rsise.anu.edu.au

Appendix F: Examples of existing semantic representations of mathematics 1. The central limit theorem as represented in Isabelle [12]: 2. The definition of a Möbius transformation in Coq [28]:

Source URL: www.wolframfoundation.org

• General topology
• Mathematics
• ACL2
• Lisp
• Compact space
• Automated theorem proving
• Software
• Mathematical logic
• Model theory

Call by Contract for Cryptographic Protocols

Source URL: evenmere.org

• Formal methods
• Logic in computer science
• Metalogic
• Automated theorem proving
• Logic programming
• Substitution
• Postcondition
• First-order logic
• Parameter
• Precondition
• Well-formed formula
• Model theory

Extending Superposition with Integer Arithmetic, Structural Induction, and Beyond Simon Cruanes École polytechnique and Inria https://who.rocq.inria.fr/Simon.Cruanes/

Source URL: cedeela.fr

• Mathematical logic
• Theoretical computer science
• Mathematics
• Automated theorem proving
• Logic in computer science
• Model theory
• First-order logic
• Mathematical proof
• Unification
• Equality

Extensional Crisis and Proving Identity? Ashutosh Gupta1 , Laura Kov´acs2 , Bernhard Kragl1,3 , and Andrei Voronkov4 1 2

Source URL: www.cse.chalmers.se

• Mathematical logic
• Mathematics
• Logic
• Automated theorem proving
• Z notation
• Set theory
• S
• Resolution
• Equality
• Mereology
• Axiom of extensionality